Analysis of finite-buffer discrete-time batch-service queue with batch-size-dependent service

نویسندگان

  • A. Banerjee
  • U. C. Gupta
  • Veena Goswami
چکیده

Over the last two decades there has been considerable growth in digital communication systems which operate on a slotted system. In several applications, transmission of packets over the network takes place in batches of varying size, and transmission time depends upon the size of the batch. Performance modelling of these systems is usually done using discrete-time queues. In view of this, we consider a singleserver queue with finite-buffer in a discrete-time domain where the packets are transmitted in batches (of varying size) according to minimum and maximum threshold limit, usually known as general batch service rule. The transmission time (in number of slots) of these batches depends on the number of packets within the batch under transmission, and is arbitrarily distributed. We obtain, in steady-state, distribution of the number of packets waiting in the queue and in service (those being transmitted in batches). In addition, we also obtain average number of packets waiting in queue, in the system, with the server, rejection probabilities, etc. Finally, computational experiences with a variety of numerical results have been discussed by introducing a cost model which gives optimum value of the lower threshold limit. 2014 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FINITE POPULATION SINGLE SERVER BATCH SERVICE QUEUE WITH COMPULSORY SERVER VACATION

A single server finite population queueing model with compulsory server vacation and with fixed batch service has been considered. For this model the system steady state probabilities are obtained. Some performance measures are calculated and numerical examples are also given.  

متن کامل

DISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY

This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...

متن کامل

ANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS

This paper presents the analysis of a renewal input  finite buffer queue wherein the customers can decide either to  join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed  by an underlying $m$-state Markov chain. Employing the supplementary  variable and imbedded Markov chain techniques,   the steady-state system length distributions at pre...

متن کامل

On a discrete-time GI/Geo/1/N queue with single working vacation and partial batch rejection

This paper treats a discrete-time finite buffer batch arrival queue with a single working vacation and partial batch rejection in which the inter-arrival and service times are, respectively, arbitrary and geometrically distributed. The queue is analyzed by using the supplementary variable and the imbedded Markov-chain techniques. We obtain steady-state system length distributions at prearrival,...

متن کامل

Analyzing discrete-time D-BMAP/G/1/N queue with single and multiple vacations

This paper analyzes a single-server finite-buffer vacation (single and multiple) queue wherein the input process follows a discrete-time batch Markovian arrival process (D-BMAP). The service and vacation times are generally distributed and their durations are integral multiples of a slot duration. We obtain the state probabilities at service completion, vacation termination, arbitrary, and prea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Industrial Engineering

دوره 75  شماره 

صفحات  -

تاریخ انتشار 2014